Constrained games as complementary eigenvalue problems
نویسندگان
چکیده
منابع مشابه
A Symplectic Perspective on Constrained Eigenvalue Problems
The Maslov index is a powerful tool for computing spectra of selfadjoint, elliptic boundary value problems. This is done by counting intersections of a fixed Lagrangian subspace, which designates the boundary condition, with the set of Cauchy data for the differential operator. We apply this methodology to constrained eigenvalue problems, in which the operator is restricted to a (not necessaril...
متن کاملSolving inverse cone-constrained eigenvalue problems
We compare various algorithms for constructing a matrix of order n whose Pareto spectrum contains a prescribed set Λ = {λ1, . . . , λp} of reals. In order to avoid overdetermination one assumes that p does not exceed n2. The inverse Pareto eigenvalue problem under consideration is formulated as an underdetermined system of nonlinear equations. We also address the issue of computing Lorentz spec...
متن کاملCone-constrained eigenvalue problems: theory and algorithms
Equilibria in mechanics or in transportation models are not always expressed through a system of equations, but sometimes they are characterized by means of complementarity conditions involving a convex cone. This work deals with the analysis of cone-constrained eigenvalue problems. We discuss some theoretical issues like, for instance, the estimation of the maximal number of eigenvalues in a c...
متن کاملA nonsmooth algorithm for cone-constrained eigenvalue problems
Such an eigenvalue problem arises in mechanics and in other areas of applied mathematics. The symbol K refers to a closed convex cone in the Euclidean space R and (A,B) is a pair of possibly asymmetric matrices of order n. Special attention is paid to the case in which K is the nonnegative orthant of R. The more general case of a possibly unpointed polyhedral convex cone is also discussed in de...
متن کاملEigenvalue-constrained Faces
We characterize the exposed faces of convex sets C of symmetric matrices, invariant under orthogonal similarity (U T CU = C for all orthogonal U). Such sets C are exactly those determined by eigenvalue constraints: typical examples are the positive semideenite cone, and unit balls of common matrix norms. The set D of all diagonal matrices in C is known to be convex if and only if C is, and D is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1980
ISSN: 0022-247X
DOI: 10.1016/0022-247x(80)90280-2